A memetic algorithm for University Course Timetabling
نویسندگان
چکیده
We present here a metaheuristic approach to the university course timetabling problem using a memetic algorithm with a very effective local search. The algorithm was tested on the International Timetabling Competition benchmark instances. Results are encouraging and show that evolutionary computation with the help of local search can compete with succesful algorithms on the problem.
منابع مشابه
Using improved Memetic Algorithm and local search to solve University Course Timetabling Problem (UCTP)
Course Timetabling is a complex problem, happening at the beginning of every semester at universities. In this problem, one of the most important issues is variety of constraints, which results in different ways of timetabling in different universities. Comparing to exact methods which take lots of time to solve UCTP, metaheuristic methods produce a feasible solution within reasonable computati...
متن کاملA Memetic Algorithm for Solving a Timetabling Problem: An Incremental Strategy
Timetabling problems are well known complicated constraint satisfaction problems. A new realworld course timetabling problem is described in this study. The difficulty in approximating to an optimal solution in a reasonable time increases for the large problem instances regardless of the algorithm used. An incremental strategy that aims to relieve this difficulty to some extent combined with a ...
متن کاملUniversity Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search...
متن کاملAn Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems
The aim of this paper is to extend our non-linear great deluge algorithm into an evolutionary approach by incorporating a population and a mutation operator to solve the university course timetabling problems. This approach might be seen as a variation of memetic algorithms. The popularity of evolutionary computation approaches has increased and become an important technique in solving complex ...
متن کاملMemetic Algorithms for Timetabling
Course timetabling problems are real world constraint optimization problems that are often coped with in educational institutions, such as universities or high schools. In this paper, we present a variety of new operators that can be also applied in evolutionary algorithms for other timetabling problems, such as, exam timetabling. Operators include violation directed mutations, crossovers, and ...
متن کامل